Approximating Viability Kernels With Support Vector Machines
نویسندگان
چکیده
منابع مشابه
Support vector machines with indefinite kernels
Training support vector machines (SVM) with indefinite kernels has recently attracted attention in the machine learning community. This is partly due to the fact that many similarity functions that arise in practice are not symmetric positive semidefinite, i.e. the Mercer condition is not satisfied, or the Mercer condition is difficult to verify. Previous work on training SVM with indefinite ke...
متن کاملDynamically Adapting Kernels in Support Vector Machines
The kernel-parameter is one of the few tunable parameters in Support Vector machines, controlling the complexity of the resulting hypothesis. Its choice amounts to model selection and its value is usually found by means of a validation set. We present an algorithm which can automatically perform model selection with little additional computational cost and with no need of a validation set. In t...
متن کاملData-driven Kernels for Support Vector Machines
Kernel functions can map data points to a non-linear feature space implicitly, and thus significantly enhance the effectiveness of some linear models like SVMs. However, in current literature, there is a lack of a proper kernel that can deal with categorical features naturally. In this paper, we present a novel kernel for SVM classification based on data-driven similarity measures to compute th...
متن کاملFast Support Vector Machines for Structural Kernels
In this paper, we propose three important enhancements of the approximate cutting plane algorithm (CPA) to train Support Vector Machines with structural kernels: (i) we exploit a compact yet exact representation of cutting plane models using directed acyclic graphs to speed up both training and classification, (ii) we provide a parallel implementation, which makes the training scale almost line...
متن کاملTangent Distance Kernels for Support Vector Machines
When dealing with pattern recognition problems one encounters different types of a-priori knowledge. It is important to incorporate such knowledge into the classification method at hand. A very common type of a-priori knowledge is transformation invariance of the input data, e.g. geometric transformations of image-data like shifts, scaling etc. Distance based classification methods can make use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2007
ISSN: 0018-9286
DOI: 10.1109/tac.2007.895881